A New Estimate of Restricted Isometry Constants for Sparse Solutions
نویسندگان
چکیده
We show that as long as the restricted isometry constant δ2k < 1/2, there exist a value q0 ∈ (0, 1] such that for any q < q0, each minimizer of the nonconvex `q minimization for the sparse solution of any underdetermined linear system is the sparse solution.
منابع مشابه
On Lp minimisation, instance optimality, and restricted isometry constants for sparse approximation
We extend recent results regarding the restricted isometry constants (RIC) and sparse recovery using l minimisation. Here we consider the case of the sparse approximation of compressible rather than exactly sparse signals. We begin by showing that the robust null space property used in [3] characterises the robustness of the estimation of compressible signals by l mimisation for all l norms, 0 ...
متن کاملBounds on restricted isometry constants of random matrices
In this paper we look at isometry properties of random matrices. During the last decade these properties gained a lot attention in a field called compressed sensing in first place due to their initial use in [7, 8]. Namely, in [7, 8] these quantities were used as a critical tool in providing a rigorous analysis of l1 optimization’s ability to solve an under-determined system of linear equations...
متن کاملSparse Recovery Algorithms: Sufficient Conditions in terms of Restricted Isometry Constants
We review three recovery algorithms used in Compressive Sensing for the reconstruction s-sparse vectors x ∈ CN from the mere knowledge of linear measurements y = Ax ∈ Cm, m < N. For each of the algorithms, we derive improved conditions on the restricted isometry constants of the measurement matrix A that guarantee the success of the reconstruction. These conditions are δ2s < 0.4652 for basis pu...
متن کاملOn Support Sizes of Restricted Isometry Constants
A generic tool for analyzing sparse approximation algorithms is the restricted isometry property (RIP) introduced by Candès and Tao. For qualitative comparison of sufficient conditions derived from an RIP analysis, the support size of the RIP constants is generally reduced as much as possible with the goal of achieving a support size of twice the sparsity of the target signal. Using a quantitat...
متن کاملImproved Analyses for SP and CoSaMP Algorithms in Terms of Restricted Isometry Constants
In the context of compressed sensing (CS), both Subspace Pursuit (SP) and Compressive Sampling Matching Pursuit (CoSaMP) are very important iterative greedy recovery algorithms which could reduce the recovery complexity greatly comparing with the well-known l1-minimization. Restricted isometry property (RIP) and restricted isometry constant (RIC) of measurement matrices which ensure the converg...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011